Tabu Search-Based Method for Bezier Curve Parameterization
نویسندگان
چکیده
منابع مشابه
Tabu Search-Based Method for Bézier Curve Parameterization
A very important issue in many applied fields is to construct the fitting curve that approximates a given set of data points optimally in the sense of least-squares. This problem arises in a number of areas, such as computer-aided design & manufacturing (CAD/CAM), virtual reality, medical imaging, computer graphics, computer animation, and many others. This is also a hard problem, because it is...
متن کاملDiscrete Rule-Based Local Search Metaheuristic for Bézier Curve Parameterization
This paper introduces a new method for solving the parameterization problem of the Bézier curve of a certain degree that approximates a given collection of data points. Our method is based on a discrete based-on-rules local search metaheuristic approach for optimization problems. The method is applied to some simple yet illustrative examples for the cases of 2D and 3D curves. Our experimental r...
متن کاملBezier curve-based generic shape encoder
Existing Bezier curve-based shape description techniques primarily focus upon determining a set of pertinent control points (CP) to represent a particular shape contour. While many different approaches have been proposed, none adequately consider domain-specific information about the shape contour like its gradualness and sharpness, in the CP generation process which can potentially result in l...
متن کاملA Bezier Curve-Based Generic Shape Encoder
Existing Bezier curve based shape description techniques primarily focus upon determining a set of pertinent Control Points (CP) to represent a particular shape contour. While many different approaches have been proposed, none adequately consider domain specific information about the shape contour like its gradualness and sharpness, in the CP generation process which can potentially result in l...
متن کاملA Simplex-Based Tabu Search Method for Capacitated Network Design
The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance. This paper presents an efficient procedure to determine tight upper bounds on the optimal solution of realistically sized problem instances. Feasible solutions are obtained by using a tabu search framework that explores the space of the continuous flow vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Software Engineering and Its Applications
سال: 2013
ISSN: 1738-9984,1738-9984
DOI: 10.14257/ijseia.2013.7.5.25